A graph-Based Approach to WSD Using Relevant Semantic Trees and N-Cliques Model
نویسندگان
چکیده
In this paper we propose a new graph-based approach to solve semantic ambiguity using a semantic net based on WordNet. Our proposal uses an adaptation of the Clique Partitioning Technique to extract sets of strongly related senses. For that, an initial graph is obtained from senses of WordNet combined with the information of several semantic categories from different resources: WordNet Domains, SUMO and WordNet Affect. In order to obtain the most relevant concepts in a sentence we use the Relevant Semantic Trees method. The evaluation of the results has been conducted using the test data set of Senseval-2 obtaining promising results.
منابع مشابه
Word Sense Disambiguation: A Graph-Based Approach Using N-Cliques Partitioning Technique
This paper presents a new approach to solve semantic ambiguity using an adaptation of the Cliques Partitioning Technique to N distance. This new approach is able to identify sets of strongly related senses using a multidimensional graph based on different resources: WordNet Domains, SUMO and WordNet Affects. As a result, each Clique will contain relevant information used to extract the correct ...
متن کاملGenerating an Indoor space routing graph using semantic-geometric method
The development of indoor Location-Based Services faces various challenges that one of which is the method of generating indoor routing graph. Due to the weaknesses of purely geometric methods for generating indoor routing graphs, a semantic-geometric method is proposed to cover the existing gaps in combining the semantic and geometric methods in this study. The proposed method uses the CityGML...
متن کاملKnowledge Based Approaches to Nepali Word Sense Disambiguation
A word may have multiple senses and the challenge is to find out which particular sense is appropriate in a given context. Word sense disambiguation(WSD) resolves this ambiguity by finding out which particular sense of a word is appropriate in a given context. WSD is of critical importance in the areas of machine translation, information retrieval, speech processing etc. In this paper we presen...
متن کاملA New Test for Interval Graphs
An interval graph is the intersection graph of a collection of intervals. Interval graphs are a special class of chordal graphs. This class of graphs has a wide range of applications. Several linear time algorithms have been designed to recognize interval graphs. Booth & Lueker first used PQ-trees to recognize interval graphs in linear time. However, the data manipulation of PQ-trees is rather ...
متن کاملOptimal Self-healing of Smart Distribution Grids Based on Spanning Trees to Improve System Reliability
In this paper, a self-healing approach for smart distribution network is presented based on Graph theory and cut sets. In the proposed Graph theory based approach, the upstream grid and all the existing microgrids are modeled as a common node after fault occurrence. Thereafter, the maneuvering lines which are in the cut sets are selected as the recovery path for alternatives networks by making ...
متن کامل